On the Decidability of Diophantine Problems in Combinatorial Geometry
نویسنده
چکیده
In spite of Matiyasevic's solution to Hubert's 10th problem some fifteen years ago it is still unknown whether there exists an algorithm to decide the solvability of diophantine equations within the field of rational numbers. In this note we show the equivalence of this problem with a conjecture of B. Grünbaum [6] on rational coordinatizability in combinatorial geometry. Such an algorithm exists if and only if the rational realizability problems for matroids, oriented matroids, and convex polytopes (Steinitz problem) are decidable.
منابع مشابه
Uncomputably large integral points on algebraic plane curves?
We show that the decidability of an amplification of Hilbert’s Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive complexity result: the Diophantine prefixes ∃∀∃ and ∃∃∀∃ are generically decidable. This means, taking the former prefix as an example, that we give a precise geome...
متن کاملComputational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: I. Given a polynomial f ∈Z[v, x, y], decide the sentence ∃v ∀x ∃y f(v, x, y) ? =0, with all three quantifiers ranging over N (or Z). II. Given polynomials f1, . . . , fm∈Z[x1, . . . , xn] with m≥n, decide if there is a rational solution to f1= · · · =fn = 0...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملDefining Integrality at Prime Sets of High Density in Number Fields
1. Introduction. Interest in the questions of Diophantine definability and decid-ability goes back to a question that was posed by Hilbert: Given an arbitrary polynomial equation in several variables over Z, is there a uniform algorithm to determine whether such an equation has solutions in Z? This question, otherwise known as Hilbert's tenth problem, has been answered negatively in the work of...
متن کاملCounting Special Points: Logic, Diophantine Geometry, and Transcendence Theory
We expose a theorem of Pila and Wilkie on counting rational points in sets definable in o-minimal structures and some applications of this theorem to problems in diophantine geometry due to Masser, Peterzil, Pila, Starchenko, and Zannier.
متن کامل